منابع مشابه
Discovering Test Set Regularities in Relational Domains
Machine learning typically involves discovering regularities in a training set, then applying these learned regularities to classify objects in a test set. In this paper we present an approach to discovering additional regularities in the test set, and show that in relational domains such test set regularities can be used to improve classification accuracy beyond that achieved using the trainin...
متن کاملSolving the P-dispersion Problem as a Sequence of Set Packing Feasibility Problems
The p-dispersion problem consists in selecting p out of n points, such that the minimum distance between any pair of chosen points is maximized. The problem has many applications in in facility location and in diversified sampling. We propose a method where a sequence of set packing feasibility problems are solved, in O(log n) iterations with a binary search procedure. Computational experiments...
متن کاملLower semicontinuity for parametric set-valued vector equilibrium-like problems
A concept of weak $f$-property for a set-valued mapping is introduced, and then under some suitable assumptions, which do not involve any information about the solution set, the lower semicontinuity of the solution mapping to the parametric set-valued vector equilibrium-like problems are derived by using a density result and scalarization method, where the constraint set $K$...
متن کاملRelating max-cut problems and binary linear feasibility problems
This paper explores generalizations of the Goemans-Williamson randomization technique. It establishes a simple equivalence of binary linear feasibility problems and max-cut problems and presents an analysis of the semidefinite max-cut relaxation for the case of a single linear equation. Numerical examples for feasible random binary problems indicate that the randomization technique is efficient...
متن کاملFeasibility problems with complementarity constraints
A Projected-Gradient Underdetermined Newton-like algorithm will be introduced for finding a solution of a Horizontal Nonlinear Complementarity Problem (HNCP) corresponding to a feasible solution of a Mathematical Programming Problem with Complementarity Constraints (MPCC). The algorithm employs a combination of Interior-Point Newton-like and Projected-Gradient directions with a line-search proc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2016
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-016-1039-x